package com.sxkiler.demo.medium;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
longest-word-in-dictionary-through-deleting=通过删除字母匹配到字典里最长单词
<p>给定一个字符串和一个字符串字典，找到字典里面最长的字符串，该字符串可以通过删除给定字符串的某些字符来得到。如果答案不止一个，返回长度最长且字典顺序最小的字符串。如果答案不存在，则返回空字符串。</p>

<p><strong>示例 1:</strong></p>

<pre>
<strong>输入:</strong>
s = "abpcplea", d = ["ale","apple","monkey","plea"]

<strong>输出:</strong> 
"apple"
</pre>

<p><strong>示例&nbsp;2:</strong></p>

<pre>
<strong>输入:</strong>
s = "abpcplea", d = ["a","b","c"]

<strong>输出:</strong> 
"a"
</pre>

<p><strong>说明:</strong></p>

<ol>
	<li>所有输入的字符串只包含小写字母。</li>
	<li>字典的大小不会超过 1000。</li>
	<li>所有输入的字符串长度不会超过 1000。</li>
</ol>

 */
public class findLongestWord {
    

    class Solution {
        public String findLongestWord(String param0,List<String> param1) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        "abpcplea"
["ale","apple","monkey","plea"]
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

